/**
* @author AlbertDarren
* @contact 2563491540@qq.com
*/
#include <cstdio>
#include <utility>
using namespace std;
const int N=50;
int intArr[N]={0};
int main_34()
{
	int n;
	scanf("%d",&n);
	for (int i=0;i<n;++i )
	{
        scanf("%d",&intArr[i]);
	}
	//assume ascending ordering
    for (int i=0;i<n;++i )
    {
        for (int j=0;j<(n-i-1);++j )
        {
            if (intArr[j]>intArr[j+1])
            {
                swap(intArr[j],intArr[j+1]);
            }
        }
    }
    for (int k=0;k<(n-1);++k )
    {
        printf("%d ",intArr[k]);
    }
    printf("%d\n",intArr[n-1]);
    return 0;
}
